Applying subclustering and Lp distance in Weighted K-Means with distributed centroids
نویسندگان
چکیده
منابع مشابه
Applying subclustering and Lp distance in Weighted K-Means with distributed centroids
We consider the weighted K-Means algorithm with distributed centroids aimed at clustering data sets with numerical, categorical and mixed types of data. Our approach allows given features (i.e., variables) to have different weights at different clusters. Thus, it supports the intuitive idea that features may have different degrees of relevance at different clusters. We use the Minkowski metric ...
متن کاملEnhanced Initial Centroids for K-means Algorithm
This paper focuses on the enhanced initial centroids for the K-means algorithm. The original kmeans is using the random choice of init ial seeds which is a major limitation of the orig inal K-means algorithm because it produces less reliab le result of clustering the data. The enhanced method of the k-means algorithm includes the computation of the weighted mean to improve the centroids initial...
متن کاملImproved Parameterless K-Means: Auto-Generation Centroids and Distance Data Point Clusters
K-means is an unsupervised learning and partitioning clustering algorithm. It is popular and widely used for its simplicity and fastness. K-means clustering produce a number of separate flat (non-hierarchical) clusters and suitable for generating globular clusters. The main drawback of the k-means algorithm is that the user must specify the number of clusters in advance. This paper presents an ...
متن کاملDiscovery of Preliminary Centroids Using Improved K- Means Clustering Algorithm
The emergence of modern technology has enforced to collect the scientific data in a large quantity and those data are getting amassed in different databases. An organized analysis of data is very essential to obtain useful information from swiftly growing data repositories. Cluster analysis is one of the major data mining methods and the k-means clustering algorithm is widely used for many prac...
متن کاملSelection of Initial Centroids for k-Means Algorithm
Clustering is one of the important data mining techniques. k-Means [1] is one of the most important algorithm for Clustering. Traditional k-Means algorithm selects initial centroids randomly and in k-Means algorithm result of clustering highly depends on selection of initial centroids. k-Means algorithm is sensitive to initial centroids so proper selection of initial centroids is necessary. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2016
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2015.08.018